Quantum circuit for the fast Fourier transform

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum fast Fourier transform using multilevel atoms

We propose an implementation of the quantum fast Fourier transform algorithm in an entangled system of multilevel atoms. The Fourier transform occurs naturally in the unitary time evolution of energy eigenstates and is used to de®ne an alternative wave-packet basis for quantum information in the atom. A change of basis from energy levels to wave packets amounts to a discrete quantum Fourier tra...

متن کامل

Fast parallel circuits for the quantum Fourier transform

We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of O(log n + log log(1/ε)) on the circuit depth for computing an approximation of the QFT with respect to the modulus 2n with error bounded by ε. Thus, even for exponentially small error, our circuits have depth O(log n). The best previous depth bound was O(n), even for approximations wit...

متن کامل

The Fast Fourier Transform

In the next two lectures, we will continue to expand our toolbox for computing in frequency domain, by adding two important computational tools. The first, the Fast Fourier Transform (FFT) is a family of algorithms for efficiently computing the Discrete Fourier Transform. These algorithms are of great practical importance, as theymake it possible to perform frequency domain analysis of very lar...

متن کامل

Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.

A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...

متن کامل

Finite Fourier Transform, Circulant Matrices, and the Fast Fourier Transform

Suppose we have a function s(t) that measures the sound level at time t of an analog audio signal. We assume that s(t) is piecewise-continuous and of finite duration: s(t) = 0 when t is outside some interval a ≤ t ≤ b. Make a change of variable x = (t− a)/(b− a) and set f(x) = s(t). Then 0 ≤ x ≤ 1 when a ≤ t ≤ b, and f(x) is a piecewise continuous function of x. We convert f(x) into a digital s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information Processing

سال: 2020

ISSN: 1570-0755,1573-1332

DOI: 10.1007/s11128-020-02776-5